A new algorithm to classify chiral polytopes with a given automorphism group
نویسندگان
چکیده
We present a new algorithm to compute all the chiral polytopes that have given group as full automorphism group. This uses set of generators characterize group, them except one being involutions. It permits groups were previously unreachable by other known algorithms.
منابع مشابه
Algorithms for classifying regular polytopes with a fixed automorphism group
In this paper, various algorithms used in the classifications of regular polytopes for given groups are compared. First computational times and memory usages are analyzed for the original algorithm used in one of these classifications. Second, a possible algorithm for isomorphism testing among polytopes is suggested. Then, two improved algorithms are compared, and finally, results are given for...
متن کاملVector representable matroids of given rank with given automorphism group
A simple way of as,;ociating a matroid of prescribed rank with a graph is shown. The matroids so corhstrueted are re.presentable over any sufficiently large field. Their ase is demonstrated by the fallowing result: Given an integer k >~ 3 and a hmction G associating a group with each subsel of a set S, the'e is a matroid M(E), representable ever any sufl]ciendy large field, such that E ~S, and ...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولOn the construction of dense lattices with a given automorphism group
We consider the problem of constructing dense lattices of Rn with a given non trivial automorphism group. We exhibit a family of such lattices of density at least cn2−n, which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions n, we exhibit a finite set of lattices that come with an automorphism group of size n, and a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Beiträge Zur Algebra Und Geometrie / Contributions To Algebra And Geometry
سال: 2021
ISSN: ['2191-0383', '0138-4821']
DOI: https://doi.org/10.1007/s13366-020-00536-1